complete adj. 1.完全的;圓滿的,全面的,全能的。 2.完成的,結(jié)束的。 3.〔古語〕老練的。 complete works (作品的)全集。 a complete set 全套。 a complete success [failure] 大成功[失敗]。 This month is now complete.本月到此結(jié)束。 The task is complete. 任務(wù)完成了。 a complete divorce 【法律】離婚。 a complete angler 釣魚名手。 vt. 完成,使完滿,使完工,完結(jié);配齊,湊滿。 complete a task 完工。 complete sb.'s happiness 使某人快樂到極點(diǎn)。 complete the whole course 修畢全部課程。 To complete (the sum of) one's misery. 不幸之上再加不幸,禍不單行。 adv. -ly ,-ness n.
A sufficient condition to decide a simple graph with a complete subgraph 簡單圖含有完全子圖的一個充分條件
Based on the research of above methods , this paper proposed two new algorithms - maxcodefmcg ( finding maximal completed subgraph ) and fsa ( finding frequent subgraph structure algorithm ) , based on maxcodefmcg algorithm and fp - growth algorithm which has been proposed , we also put forward a new algorithm - maxcodefp - tree to find frequent patterns . the advantage of maxcodefp - tree is saving memory , and fsa resolves the restriction of “ graphs with different labels and same structures are deemed as different ” 基于前人的研究,本文提出了兩個新的算法? ?極大完全子圖挖掘算法( maxcodefmcg算法)和頻繁子圖結(jié)構(gòu)挖掘算法( fsa算法) ,并將maxcodefmcg算法與已有的頻繁模式挖掘算法fp - growth算法相結(jié)合,產(chǎn)生了一種基于圖結(jié)構(gòu)的頻繁模式挖掘算法( maxcodefp - tree算法) 。